Multicommodity network flow model of a human resource allocation problem considering time periods
نویسندگان
چکیده
Abstract This article addresses the problem of finding work assignments for employees within a given time horizon in company using multicommodity network flow model. The human resource allocation is defined by actual manpower demands different periods which may vary during periods. investigation focuses on when workers should be called in-house and how long to satisfy demands, while also complying with labour standards regulations. Additional targets set up, such as minimising overall number labour, well meeting “comfort” expectations, i.e. most even working realised every worker event horizon. paper describes model constructed corresponding MILP mathematical programming formulated simple situation where there only one position labour. Finally, explains construct general case, are multiple positions requiring various skills competences per
منابع مشابه
An Intelligent Algorithm for Optimization of Resource Allocation Problem by Considering Human Error in an Emergency Department
Human error is a significant and ever-growing problem in the healthcare sector. In this study, resource allocation problem is considered along with human errors to optimize utilization of resources in an emergency department. The algorithm is composed of simulation, artificial neural network (ANN), design of experiment (DOE) and fuzzy data envelopment analysis (FDEA). It is a multi-response opt...
متن کاملCooperative network flow problem with pricing decisions and allocation of benefits: A game theory approach
Several real problems in telecommunication, transportation, and distribution industries can be well analyzed by network flow models. In revenue management, pricing plays a primary role which increases the profit generated from a limited supply of assets. Pricing decision directly affects the amount of service or product demand. Hence, in traditional maximum flow problem, we assume that the dema...
متن کاملSolving the Resource Allocation Problem in a Multimodal Container Terminal as a Network Flow Problem
Continuously increasing global container trade and pressure from a limited number of large shipping companies are enforcing the need for efficient container terminals. By using internal material handling resources efficiently, transfer times and operating costs are reduced. We focus our study on container terminals using straddle carriers for transportation and storage operations. We assume tha...
متن کاملMulticommodity Network Flow Problems
In this paper, we consider to apply a primal-dual proximal point algorithm to the multicommodity network flow problem. A remarkable feature of the algorithm consists in how to find an approximate saddle point of the augmented Lagrangian of the problem. In particular, at each iteration, an approximate solution of the subproblem always satisfies the flow conservation equations for all commodities...
متن کاملMulticommodity network flow approach to the railroad crew-scheduling problem
We present our solution to the crew-scheduling problem for North American railroads. (Crew scheduling in North America is very different from scheduling in Europe, where it has been well studied.) The crew-scheduling problem is to assign operators to scheduled trains over a time horizon at minimal cost while honoring operational and contractual requirements. Currently, decisions related to crew...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Central European Journal of Operations Research
سال: 2023
ISSN: ['1613-9178', '1435-246X']
DOI: https://doi.org/10.1007/s10100-023-00868-y